Relative Proot Auctions
نویسندگان
چکیده
We study independent private value auctions where bidders have preferences over relative payoos. We derive symmetric equilibria for four important auction forms: rst-price, second-price, English, and Dutch. We nd that equilibrium bidding is more aggressive than standard predictions. Indeed, in second-price auctions it is optimal to bid above one's valuation when bidders care about relative payoos. Further, strategic equivalence between second-price and English auctions no longer holds; for all but the two highest-valued bidders, bidding is more aggressive in the second-price auction. Despite the fact that all the auctions we study are ex post eecient, revenue equivalence also no longer holds|English auctions always outperform second-price auctions. Moreover, when two bidders are competing, or when valuations are uniformly distributed, second-price auctions have higher expected revenues than rst-price auctions. Finally, we show that bidding in rst-price relative proot auctions is behaviorally equivalent to bidders having preferences exhibiting constant relative risk aversion.
منابع مشابه
An Admission Control Paradigm for Value-cognizant Real-Time Databases
We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task and a compensating task. The execution requirements of the primary task are not known a priori, whereas those of the compensating task are known a priori. Upon the submission of a transaction , an Admission Control Mechanism is employed to dec...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملAn Algorithm for Trading and Portfolio Management Using Q-learning and Sharpe Ratio Maximization
A trading and portfolio management system called QSR is proposed. It uses Q-learning and Sharpe ratio maximization algorithm. We use absolute proot and relative risk-adjusted proot as performance function to train the system respectively, and employ a committee of two networks to do the testing. The new proposed algorithm makes use of the advantages of both parts and can be used in a more gener...
متن کاملTime dependent Directional Pro t Model for Financial Time SeriesForecastingJingtao
Goodness-of-t is the most popular criterion for neural network time series forecasting. In the context of nancial time series forecasting, we are not only concerned at how good the forecasts t their targets, but we are more interested in proots. In order to increase the forecastability in terms of proot earning, we propose a proot based adjusted weight factor for backpropagation network trainin...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کامل